Presented in the 33rd Annual Meeting of the Association for Computational Linguistics TAL Recognition in O(M(n2)) Time
نویسندگان
چکیده
We propose an O(M(n)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but also algorithms designers. The first polynomial time algorithm for TAL parsing was proposed in 1986 and had a run time of O(n). Quite recently, an O(n M(n)) algorithm has been proposed. The algorithm presented in this paper improves the run time of the recent result using an entirely different approach.
منابع مشابه
33rd Annual Meeting of the Association for Computational Linguistics, 26-30 June 1995, MIT, Cambridge, Massachusetts, USA, Proceedings
متن کامل
TAL Recognition in O(M(n)) Time1
We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k × k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but ...
متن کاملA physiologically plausible spatiotemporal model of bold allows deconvolution of hemodynamic and neuron response components
Abstract presented at the Australian Neuroscience Society Inc 33rd Annual Meeting, 3-6 Feb 2013, Melbourne, Australiapresented at the Australian Neuroscience Society Inc 33rd Annual Meeting, 3-6 Feb 2013, Melbourne, Australia
متن کاملTAL Recognition in O(M(n2)) Time
We propose an O(M(n2)) time algorithm for the recognition of Tree Adjoining Languages (TALs), where n is the size of the input string and M(k) is the time needed to multiply two k x k boolean matrices. Tree Adjoining Grammars (TAGs) are formalisms suitable for natural language processing and have received enormous attention in the past among not only natural language processing researchers but ...
متن کامل